Adaptive Quantization for Predicting Transform-Based Point Cloud Compression

نویسندگان

چکیده

The representation of three-dimensional objects with point clouds is attracting increasing interest from researchers and practitioners. Since this requires a huge data volume, effective cloud compression techniques are required. One the most powerful solutions Moving Picture Experts Group geometry-based (G-PCC) emerging standard. In G-PCC lifting transform coding technique, an adaptive quantization method used to improve efficiency. Instead assigning same step size all points, increased according level detail traversal order. way, attributes more important points receive finer have smaller error than less ones. paper, we adapt approach predicting propose hardware-friendly weighting for quantization. Experimental results show that compared current test model, proposed can achieve average Bjontegaard delta rate −6.7%, −14.7%, −15.4%, −10.0% luma, chroma Cb, Cr, reflectance components, respectively on MPEG Cat1-A, Cat1-B, Cat3-fused Cat3-frame datasets.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Octree-based Point-Cloud Compression

In this paper we present a progressive compression method for point sampled models that is specifically apt at dealing with densely sampled surface geometry. The compression is lossless and therefore is also suitable for storing the unfiltered, raw scan data. Our method is based on an octree decomposition of space. The point-cloud is encoded in terms of occupied octree-cells. To compress the oc...

متن کامل

Dynamic Compression of Curve-Based Point Cloud

With the increasing demands for highly detailed 3D data, dynamic scanning systems are capable of producing 3D+t (a.k.a. 4D) spatio-temporal models with millions of points recently. As a consequence, effective 4D geometry compression schemes are required to face the need to store/transmit the huge amount of data, in addition to classical static 3D data. In this paper, we propose a 4D spatio-temp...

متن کامل

Hierarchical Shape-Adaptive Quantization for Geometry Compression

The compression of polygonal mesh geometry is still an active field of research as in 3d no theoretical bounds are known. This work proposes a geometry coding method based on predictive coding. Instead of using the vertex to vertex distance as distortion measurement, an approximation to the Hausdorffdistance is used resulting in additional degrees of freedom. These are exploited by a new adapti...

متن کامل

Geometric 3D point cloud compression

This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the co...

متن کامل

Subspaces of Quantization Artifacts for Image Transform Compression

This paper presents a new algorithm for reducing quantization artifacts in transform coded images. For transform coded signals, we analytically show that one can determine linear subspaces where most of the quantization artifacts reside. We formulate statistical constraints that identify these subspaces and propose a simple algorithm that removes them. Our formulation is general and is not tied...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-87355-4_62